Algorithms for finding the maximal length quasiplateau interval of the experimental curve
نویسندگان
چکیده
There exist some problems related to the determination of the quasiplateau region in experimental sciences. The paper describes two approaches to this matter which lead to two algorithms for finding the maximal length quasiplateau interval for discrete data. Numerical tests are presented.
منابع مشابه
A Hybrid Algorithm using Firefly, Genetic, and Local Search Algorithms
In this paper, a hybrid multi-objective algorithm consisting of features of genetic and firefly algorithms is presented. The algorithm starts with a set of fireflies (particles) that are randomly distributed in the solution space; these particles converge to the optimal solution of the problem during the evolutionary stages. Then, a local search plan is presented and implemented for searching s...
متن کاملGenetic Parameter Estimates for Lactation Curve Parameters, Milk Yield, Age at First Calving, Calving Interval and Somatic Cell Count in Holstein Cows
The objective of this study was to estimates the genetic and environmental components for the lactation curve parameters, milk yield, age at first calving (AFC), calving interval (CI) and somatic cell count (SCC) in Iranian Holstein cows. The dataset consisted of 210625 test day records from 25883 cows with milk yield in the first parity recorded from July 2002 to September 2007 in a total of 9...
متن کاملEvaluating Quasi-Monte Carlo (QMC) algorithms in blocks decomposition of de-trended
The length of equal minimal and maximal blocks has eected on logarithm-scale logarithm against sequential function on variance and bias of de-trended uctuation analysis, by using Quasi Monte Carlo(QMC) simulation and Cholesky decompositions, minimal block couple and maximal are founded which are minimum the summation of mean error square in Horest power.
متن کاملA Proximal Point Algorithm for Finding a Common Zero of a Finite Family of Maximal Monotone Operators
In this paper, we consider a proximal point algorithm for finding a common zero of a finite family of maximal monotone operators in real Hilbert spaces. Also, we give a necessary and sufficient condition for the common zero set of finite operators to be nonempty, and by showing that in this case, this iterative sequence converges strongly to the metric projection of some point onto the set of c...
متن کاملGeneral form of a cooperative gradual maximal covering location problem
Cooperative and gradual covering are two new methods for developing covering location models. In this paper, a cooperative maximal covering location–allocation model is developed (CMCLAP). In addition, both cooperative and gradual covering concepts are applied to the maximal covering location simultaneously (CGMCLP). Then, we develop an integrated form of a cooperative gradual maximal covering ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Annales UMCS, Informatica
دوره 7 شماره
صفحات -
تاریخ انتشار 2007